Search results for " 14Q20"
showing 2 items of 2 documents
OPTIMIZATIONS FOR TENSORIAL BERNSTEIN–BASED SOLVERS BY USING POLYHEDRAL BOUNDS
2010
The tensorial Bernstein basis for multivariate polynomials in n variables has a number 3n of functions for degree 2. Consequently, computing the representation of a multivariate polynomial in the tensorial Bernstein basis is an exponential time algorithm, which makes tensorial Bernstein-based solvers impractical for systems with more than n = 6 or 7 variables. This article describes a polytope (Bernstein polytope) with a number of faces, which allows to bound a sparse, multivariate polynomial expressed in the canonical basis by solving several linear programming problems. We compare the performance of a subdivision solver using domain reductions by linear programming with a solver using a c…
Algebraic-geometric techniques for the feedback classification and robustness of the optimal control of a pair of Bloch equations with application to…
2017
The aim of this article is to classify the singular trajectories associated with the optimal control problems of a pair of controlled Bloch equations. The motivation is to analyze the robustness of the optimal solutions to the contrast and the time-minimal saturation problem, in magnetic resonance imaging, with respect to the parameters and B1-inhomogeneity. For this purpose, we use various computer algebra algorithms and methods to study solutions of polynomial systems of equations and inequalities which are used for classification issues: Gröbner basis, cylindrical algebraic decomposition of semi-algebraic sets, Thom's isotopy lemma.